Optimization With Affine Homogeneous Quadratic Integral Inequality Constraints
نویسندگان
چکیده
منابع مشابه
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
We consider the NP-hard problem of finding a minimum norm vector in n-dimensional real or complex Euclidean space, subject to m concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an O(m) approximation in the real case, and an O(m) approximation in the complex case. Moreo...
متن کاملApproximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are nonconvex in general, t...
متن کاملIntegral Quadratic Constraints
Integral Quadratic Constraints (IQC) are inequalities used to describe (partially) possible signal combinations within a given dynamical system. IQC offer a framework for abstracting ”challenging” (e.g. non-linear, time-varying, uncertain, or distributed) elements of dynamical system models to aid in rigorous analysis of robust stability and performance (more specifically, to establish L2 gain ...
متن کاملAnalysis and Design of Optimization Algorithms via Integral Quadratic Constraints
This manuscript develops a new framework to analyze and design iterative optimization algorithms built on the notion of Integral Quadratic Constraints (IQC) from robust control theory. IQCs provide sufficient conditions for the stability of complicated interconnected systems, and these conditions can be checked by semidefinite programming. We discuss how to adapt IQC theory to study optimizatio...
متن کاملQPECgen, a MATLAB Generator for Mathematical Programs with Quadratic Objectives and Affine Variational Inequality Constraints
We describe a technique for generating a special class, called QPEC, of mathematical programs with equilibrium constraints, MPEC. A QPEC is a quadratic MPEC, that is an optimization problem whose objective function is quadratic, first-level constraints are linear, and second-level (equilibrium) constraints are given by a parametric affine variational inequality or one of its specialisations. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2017
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2017.2703927